An explicit construction of quantum codes from one-generator generalized quasi-cyclic codes
نویسندگان
چکیده
In this paper, we take advantage of a class one-generator generalized quasi-cyclic (GQC) codes index 2 to construct quantum error-correcting codes. By studying the form Hermitian dual and their algebraic structure, propose sufficient condition for self-orthogonality GQC with inner product. comparison, constructed have better parameters than known
منابع مشابه
One - Generator Quasi - Cyclic Quaternary Linear Codes and Construction X
Let GF (q) denote the Galois field of q elements, and let V (n, q) denote the vector space of all ordered n-tuples over GF (q). The number of nonzero positions in a vector x ∈ V (n, q) is called the Hamming weight wt(x) of x. The Hamming distance d(x,y) between two vectors x,y ∈ V (n, q) is defined by d(x,y) = wt(x − y). A linear code C of length n and dimension k over GF (q) is a k-dimensional...
متن کاملOne generator quasi-cyclic codes over F2 + uF2 + vF2 + uvF2
In this paper, we study the structure of 1-generator quasi-cyclic codes over the ring R = F2 +uF2 + vF2 + uvF2, with u2 = v2 = 0 and uv = vu. We determine the minimal spanning sets for these codes. As a generalization of these codes, we also investigate the structure of 1-generator generalized quasi-cyclic codes over R and determine a BCH type bound for them.
متن کاملSkew Generalized Quasi-cyclic Codes
This article discusses skew generalized quasi-cyclic codes over any finite field F with Galois automorphism θ. This is a generalization of quasi-cyclic codes and skew polynomial codes. These codes have an added advantage over quasi-cyclic codes since their lengths do not have to be multiples of the index. After a brief description of the skew polynomial ring F[x; θ], we show that a skew general...
متن کاملConstruction of Quasi-Cyclic Product Codes
Linear quasi-cyclic product codes over finite fields are investigated. Given the generating set in the form of a reduced Gröbner basis of a quasi-cyclic component code and the generator polynomial of a second cyclic component code, an explicit expression of the basis of the generating set of the quasicyclic product code is given. Furthermore, the reduced Gröbner basis of a one-level quasi-cycli...
متن کاملConstruction of quasi-cyclic self-dual codes
There is a one-to-one correspondence between l-quasi-cyclic codes over a finite field Fq and linear codes over a ring R = Fq[Y ]/(Y m − 1). Using this correspondence, we prove that every l-quasi-cyclic self-dual code of length ml over a finite field Fq can be obtained by the building-up construction, provided that char (Fq) = 2 or q ≡ 1 (mod 4), m is a prime p, and q is a primitive element of F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC web of conferences
سال: 2021
ISSN: ['2261-236X', '2274-7214']
DOI: https://doi.org/10.1051/matecconf/202133604001